Xideal Grr Obner Bases for Exterior Algebra
نویسندگان
چکیده
1 Description The method of Grr obner bases in commutative polynomial rings introduced by Buchberger (e.g. 1]) is a well-known and very important tool in polynomial ideal theory, for example in solving the ideal membership problem. XIDEAL extends the method to exterior algebras using algorithms from 2]. There are two main departures from the commutative polynomial case. First, owing to the non-commutative product in exterior algebras, ideals are no longer automatically two-sided, and it is necessary to distinguish between left and right ideals. Secondly, because there are zero divisors, connu-ent reduction relations are no longer suucient to solve the ideal membership problem: a unique normal form for every polynomial does not guarantee that all elements in the ideal reduce to zero. This leads to two possible deenitions of Grr obner bases as pointed out by Stokes 3]. XIDEAL constructs Grr obner bases for solving the left ideal membership problem: Grr obner left ideal bases or GLIBs. For graded ideals, where each form is homogeneous in degree, the distinction between left and right ideals
منابع مشابه
Linear Algebra Methods for the Transformation of Grr Obner Bases Linear Algebra Methods for the Transformation of Grr Obner Bases
A solution to the problem of converting a Grr obner basis between different orderings for a given ideal is known for the zero-dimensional case. We show how to solve this problem for one-dimensional ideals in two variables by using the same linear algebra techniques that are exploited in the existing algorithm. For ideals in more than two variables we describe two other known approaches that als...
متن کاملMonomial Representations for Grr Obner Bases Computations
Monomial representations and operations for Grr obner bases computations are investigated from an implementation point of view. The technique of vectorized monomial operations is introduced and it is shown how it expedites computations of Grr obner bases. Furthermore, a rank-based monomial representation and comparison technique is examined and it is concluded that this technique does not yield...
متن کاملGrr Obner Bases in Type Theory
We describe how the theory of Grr obner bases, an important part of computational algebra, can be developed within Martin-LL of's type theory. In particular, we aim for an integrated development of the algorithms for computing Grr obner bases: we want to prove, constructively in type theory, the existence of Grr obner bases and from such proofs extract the algorithms. Our main contribution is a...
متن کاملGrr Obner Bases for Polynomial Ideals over Commutative Noetherian Rings and Related Results ?
We present a completion-like procedure for constructing weak and strong Grr obner bases for polynomial ideals over commutative Noetherian rings with unit. This generalizes all the known algorithms for computing Grr obner bases for polynomial ideals over various diierent coeecient domains. The coeecient domain is incorporated using constraints. Constraints allow us to describe an optimized proce...
متن کاملOn Some Basic Applications of Grr Obner Bases in Non-commutative Polynomial Rings
In this paper we generalize some basic applications of Grr obner bases in commutative polynomial rings to the non-commutative case. We deene a non-commutative elimination order. Methods of nding the intersection of two ideals are given. If both the ideals are monomial we deduce a nitely written basis for their intersection. We nd the kernel of a homomorphism, and decide membership of the image....
متن کامل